Selection criteria for efficient implementation of FFT algorithms

Efficient Overlapped Fft Algorithms for Hypercube-connected Multicomputers

In this work, we propose parallel FFT algorithms, for medium-to-coarse grain hypercubeconnected multicomputers, which are more elegant and efficient than the existing ones. The proposed algorithms achieve perfect load-balance for the efficient simplified-butterfly scheme, minimize the communication overhead by decreasing both the number and the volume of concurrent communications. Communication...

FFT-Based Efficient Algorithms for Time Delay Estimation

Suppose that we have a single sensor receiving a superimposition of attenuated and delayed replicas of a known signal plus noise. From the received data we want to estimate the arrival times of the various replicas and their (complex or real) attenuation coefficients (gains). This is the well-known time delay estimation problem which occurs in many fields including radar, active sonar, wireless...

Implementation and performance evaluation of parallel FFT algorithms

Fast Fourier Transform (FFT) algorithms are widely used in many areas of science and engineering. Some of the most widely known FFT algorithms are Radix-2 algorithm, Radix-4 algorithm, Split Radix algorithm, Fast Hartley transformation based algorithm and Quick Fourier transform. In this paper, the first three algorithms listed are implemented in the sequential and MPI (message passing interfac...

Eecient Implementation of Fft-like Algorithms on Mimd Systems

FFT Algorithms

The DFT usually arises as an approximation to the continuous Fourier transform when functions are sampled at discrete intervals in space or time. The naive evaluation of the discrete Fourier transform is a matrix-vector multiplication W~g, and would take O(N) operations for N data-points. The general principle of the Fast Fourier Transform algorithms is to use a divide-and-conquer strategy to f...